Concealing Block Sizes Is Not Sufficient

نویسندگان

  • Vance W. Berger
  • Xin He
  • Jeehyoung Kim
  • Wonshik Shin
چکیده

correctly noted that blocked randomiza-tion has a disadvantage that " the executer can predict the next assignment " and this is clearly incompatible with allocation concealment. So we can agree that permuted blocks with a fixed block size should never be used in ran-domized trials. 2) But what is the solution to this problem? Kim and Shin 1) indicated that " To solve this problem, the allocator must hide the block size form the executer and use randomly mixed block sizes. " This would be an ideal solution if our only objective were to minimize determin-istic allocations. But some allocations are predictable even while not being entirely deterministic. For example, if the block size is four, and the identity of the first treatment allocated is known, then the second allocation is not deter-ministic, but it is still predictable, since it is twice as likely to be the treatment that was not allocated first. These predictable allocations allow investigators betting odds, so even these must be minimized. The reality is that even with unusual, varied, and con cealed block sizes, there will still be some deterministic allocations, and an abundance of predictable allocations. For example, suppose it is known that the block sizes in a given unmasked trial are varied, two and four, and suppose that at a certain point in the trial there are two more patients allocated to the control group than to the active group. Then it can be deduced that the current block size is four, since a block of size two will never allow the imbalance to exceed one. We also know that we are halfway through a CCAA block, so the next two allocations must be to the active group. But the bigger issue is, as noted, the large number of predictable allocations. Any randomization procedure that is restricted so as to force equal numbers allocated to each treatment group will be vulnerable to the convergent strategy of guessing (without certainty) that the next treatment to be allocated will be the one so far less well represented. This is not particular to permuted blocks with either fixed or varied block sizes. However, varying block sizes will be more susceptible since there are smaller blocks (on average) than there would be with a fixed block size of the largest size used. Hence, the convergent strategy will be more effective with varied block sizes than it will …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quality Measurements of Lossy Image Steganography Based on H-AMBTC Technique Using Hadamard Transform Domain

Steganography is a type of image information concealing technique which hides a secret message in a different media such as image, video and audio etc, called cover file. The main idea of steganography is to provide security to private or public data. In this paper we combined among Hadamard transformation and Absolute Moment Block Truncation Coding to make a new concept called (H-AMBTC), this ...

متن کامل

OPTIMAL BLOCK DESIGNS WITH UNEQUAL BLOCK SIZES FOR MAKING TEST TREATMENTS-CONTROL COMPARISONS UNDER A HETEROSCEDASTIC MODEL∗ By RAJENDER PARSAD and V.K. GUPTA

This article obtains some sufficient conditions to establish the A-optimality of block designs with unequal block sizes for making test treatments control comparisons under a suitable heteroscedastic model. Balanced test treatments incomplete block designs with unequal block sizes of type G are defined. Some general methods of constructing these designs are given and their A-efficiencies are in...

متن کامل

Optimum Block Size in Separate Block Bootstrap to Estimate the Variance of Sample Mean for Lattice Data

The statistical analysis of spatial data is usually done under Gaussian assumption for the underlying random field model. When this assumption is not satisfied, block bootstrap methods can be used to analyze spatial data. One of the crucial problems in this setting is specifying the block sizes. In this paper, we present asymptotic optimal block size for separate block bootstrap to estimate the...

متن کامل

Non-Reconstructability in the Stochastic Block Model

We consider the problem of clustering (or reconstruction) in the stochastic block model, in the regime where the average degree is constant. For the case of two clusters with equal sizes, recent results [MNS13, Mas14, MNS14] show that reconstructability undergoes a phase transition at the Kesten-Stigum bound of λ 2 d = 1, where λ2 is the second largest eigenvalue of a related stochastic matrix ...

متن کامل

Resolvable balanced incomplete block designs with subdesigns of block size 4

In this paper, we look at resolvable balanced incomplete block designs on v points having blocks of size 4, briefly (v, 4, 1) RBIBDs. The problem we investigate is the existence of (v, 4, 1) RBIBDs containing a (w, 4, 1) RBIBD as a subdesign. We also require that each parallel class of the subdesign should be in a single parallel class of the containing design. Removing the subdesign gives an i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2015